package 力扣日常刷题.木23一月.第13天313;

/**
 * @author 帅小伙
 * @date 2022/3/13
 * @description
 */
public class Demo56搜索旋转排序数组 {


    public int search(int[] nums, int target) {
        int l = 0,r = nums.length - 1;

        while(l < r) {
            int mid = (l+r)>>1;
            if(nums[mid] == target) return mid;
            if(nums[0] < nums[mid]) {
                if(target < nums[mid] && nums[0] <= target) {
                    r = mid - 1;
                }else {
                    l = mid + 1;
                }
            }else {
                if(nums[mid] < target &&target <= nums[nums.length - 1]) {
                    l = mid + 1;
                } else {
                    r = mid - 1;
                }
            }
        }
        return -1;
    }

}
